Ant Colony Optimization Algorithms for Dynamic Optimization: A Case Study of the Dynamic Travelling Salesperson Problem [Research Frontier]
نویسندگان
چکیده
منابع مشابه
New Approach for Solving Dynamic Travelling Salesman Problem with Hybrid Genetic Algorithms and Ant Colony Optimization
Dynamic travelling salesman problem (DTSP) is one of the optimization issues which it is not solvable with classical methods. To solve this problem, various solutions in the literature can be seen that each has advantages and disadvantages. Genetic Algorithm (GA) and Ant Colony Optimization (ACO) have been good to solve the DTSP. In this paper, we highlight a new algorithm by combining genetic ...
متن کاملA memetic ant colony optimization algorithm for the dynamic travelling salesman problem
Ant colony optimization (ACO) has been successfully applied for combinatorial optimization problems, e.g., the travelling salesman problem (TSP), under stationary environments. In this paper, we consider the dynamic TSP (DTSP), where cities are replaced by new ones during the execution of the algorithm. Under such environments, traditional ACO algorithms face a serious challenge: once they conv...
متن کاملA New Optimization Method for Dynamic Travelling Salesman Problem with Hybrid Ant Colony Optimization Algorithm and Particle Swarm Optimization
In recent decades, with the introduction of optimization problems, new methods of was optimizing developed. The most important group of optimization techniques is meta-heuristic method. That is able to solve the problems of combination optimizing. The major problems in the combination optimizing such as Dynamic Travelling Salesman Problem (DTSP) is a kind of problems that is close answer to the...
متن کاملParallel Implementation of Ant Colony Optimization for Travelling Salesman Problem
A parallel ant colony algorithm for the Travelling Salesman Problem (TSP) is presented. Some experiments using a MPI based framework are made and analyzed. The achieved results prove that the TSP parallel implementation is efficient. Key-Words: Travelling Salesman Problem, Ant Colony Optimization, Parallel Algorithms, Framework, Message Passing Interface.
متن کاملTravelling Salesperson Problem for Dynamic Systems
In this paper, we study the following version of the Travelling Salesperson Problem: Find the fastest closed trajectory for a controlled dynamic system such that its output visits all points in a given (finite) set. We present an algorithm that, if the n points are randomly sampled from a uniform distribution, produces an output trajectory the expected duration of which scales within a constant...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Computational Intelligence Magazine
سال: 2020
ISSN: 1556-603X,1556-6048
DOI: 10.1109/mci.2019.2954644